Memoryless Near-Collisions, Revisited

An Adaptive Memoryless Tag Anti-Collision Protocol for RFID Networks

* This work was funded by SK Telecom under Contract Number KU-R0405721 to Korea University. Abstract— Tag collision arbitration for passive RFID tags is significant for fast identification. This paper presents an adaptive memoryless tag anti-collision protocol which is an improvement on the query tree protocol. To identify tags efficiently, we use information about tags the reader already know....

Small Robust Response-Surface Designs for Quantitative and Qualitative Factors

Alphabet Source Coding Theorem Revisited En-hui Yang and Zhen Zhang * University of Waterloo, Ontario CANADA, e-mail: [email protected] **University of Southern California, Los Angeles, CA 90089, USA, [email protected] The abstract alphabet source coding theorem is revisited. For coding at a fixed rate level, it is shown that for any fixed rate R > 0 and any memoryless abstract alphab...

Squeezing the Arimoto-Blahut algorithm for faster convergence

The Arimoto–Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A so-called “squeezing” strategy is used to design algorithms that preserve its simplicity and monotonic convergence properties, but have provably better rates of convergence.

Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit

The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly ...

POLARIZATION ASYMMETRIES IN γe COLLISIONS AND TRIPLE GAUGE BOSON COUPLINGS REVISITED a